Cutwidth of the r-dimensional mesh of d-ary trees
نویسنده
چکیده
We prove that the cutwidth of the r-dimensional mesh of d-ary trees is of order (d (r?1)n+1), which improves and generalizes the previous result of Barth 2]. Resum e Nous provons que la largeur de coupe de la grille r-dimensionall d'arbres d-naires est d'ordre (d (r?1)n+1), que ameliore et generalise le resultat de Barth 2].
منابع مشابه
Cutwidth of the Mesh of dary Trees
In this paper we show that the cutwidth of the mesh of d-ary trees MT(d; n) is of order (d n+1), which improves both upper and lower bounds of Barth 2], by a factor of d.
متن کاملStudy of Random Biased d-ary Tries Model
Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملP´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 34 شماره
صفحات -
تاریخ انتشار 2000